Timed Petri nets and timed automata: On the discriminating power of zeno sequences
نویسندگان
چکیده
منابع مشابه
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equivalence. Thus we propose an extension of timed Petri nets with read-arcs (RA-TdPN), whose coverability problem is decidable. We also show that this model unifies timed Petri nets and timed automata. Then, we establish nu...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملTimed-Arc Petri Nets vs. Networks of Timed Automata
We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass where every clock used in the guard has to be reset). The presented translations are very tight (up to isomorphism of labelled transition systems with time). This provides a convenient characterization from the theoretical poin...
متن کاملFrom Time Petri Nets to Timed Automata
In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally ...
متن کاملFiring Sequences Estimation for Timed Petri Nets
This work deals with the firing sequences estimation for transitions timed Petri nets by measurement of the places marking. Firing durations are unknown, but supposed not to be null. In fact, the Petri net marking is measured, on line, with a sampling period ∆t small enough such that each transition is fired, at the most, one time during ∆t. The estimation problem has exact and approximated sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2008
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.10.004